Sokoban: improving the search with relevance cuts
نویسندگان
چکیده
Humans can eeectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish between relevant and irrelevant actions (moves). In this paper we present a new single-agent search pruning technique that is based on a move's innuence. The innuence measure is a crude form of relevance in that it is used to diierentiate between local (relevant) moves and non-local (irrelevant) moves, with respect to the sequence of moves leading up to the current state. Our pruning technique uses the m previous moves to decide if a move is relevant in the current context and, if not, to cut it oo. This technique results in a large reduction in the search eeort required to solve Sokoban problems.
منابع مشابه
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish between relevant and irrelevant actions (moves). In this paper we present a new single-agent search pruning technique that is based on a move's in uence. The in uence measure is a crude form of relevance in that it is...
متن کاملSingle-Agent Search in the Presence of Deadlocks
Single-agent search is a powerful tool for solving a variety of applications. Most of the application domains used to explore single-agent search techniques have the property that if you start with a solvable state, at no time in the search can you reach a state that is unsolvable. In this paper we address the implications that arise when state transitions can lead to unsolvable (deadlock) stat...
متن کاملSokoban: Reversed Solving
This article describes a new method for attempting to solve Sokoban puzzles by means of an efficient algorithm, a task which has proven to be extremely difficult because of both the huge search tree depth and the large branching factor. We present a way of solving Sokoban puzzles that, using several heuristics, starts from the final state of a puzzle, and from there works its way back to the in...
متن کاملImproved Heuristic and Tie-Breaking for Optimally Solving Sokoban
We present a novel admissible pattern database heuristic (D) and tie-breaking rule (L) for Sokoban, allowing us to increase the number of optimally solved standard Sokoban instances from 20 to 28 and the number of proved optimal solutions from 25 to 32 compared to previous methods. The previously best heuristic for Sokoban (I) used the idea of an intermediate goal state to enable the effective ...
متن کاملSokoban: Evaluating Standard Single-Agent Search Techniques in the Presence of Deadlock
Single-agent search is a powerful tool for solving a variety of applications. Most of the academic application domains used to explore single-agent search techniques have the property that if you start with a solvable state, at no time in the search can you reach a state that is unsolvable (it may, however, not be minimal). In this paper we address the implications that arise when states in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 252 شماره
صفحات -
تاریخ انتشار 2001